An integrated ranking algorithm for efficient information computing in social networks

Social networks have ensured the expanding disproportion between the face of WWW stored traditionally in search engine repositories and the actual ever changing face of Web. Exponential growth of web users and the ease with which they can upload contents on web highlights the need of content controls on material published on the web. As definition of search is changing, socially-enhanced interactive search methodologies are the need of the hour. Ranking is pivotal for efficient web search as the search performance mainly depends upon the ranking results. In this paper new integrated ranking model based on fused rank of web object based on popularity factor earned over only valid interlinks from multiple social forums is proposed. This model identifies relationships between web objects in separate social networks based on the object inheritance graph. Experimental study indicates the effectiveness of proposed Fusion based ranking algorithm in terms of better search results.Comment: 14 pages, International Journal on Web Service Computing (IJWSC), Vol.3, No.1, March 201

Intelligent Retrieval Model: Object Oriented Search Methodology on Web

Information handling through improved search mechanisms is and will remain the driving force behind rich patterns of access to web contents. Keyword search offers only an imperfect solution to information discovery over web as it misses many relevant documents of today2019;s users. By its fundamental nature, keyword search is sharply focused to find the exact terms specified in the query. The proposed Intelligent Retrieval Model exploits the object oriented concepts for information representation. This kind of conceptual modeling of web based inheritance boosts data structuring flexibility and caters to the density of diverse web information needs. The guiding principle of proposed model for intelligent retrieval over World Wide Web is the adequate representation of relevant complex relationships between the various entities in the real world. The result approves better hierarchical relationship recognition among web objects leading to less complex computing

Testability Assessment Model for Object Oriented Software based on Internal and External Quality Factors

Software testability is coming out to be most frequent talked about subject then the underrated and unpopular quality factor it used to be in past few years. The correct and timely assessment of testability can lead to improvisation of software testing process. Though many researchers and quality controllers have proved its importance, but still the research has not gained much momentum in emphasizing the need of making testability analysis necessary during all software development phases. In this paper we review and analyse the factors affecting testability estimation of object oriented software systems during design and analysis phase of development life cycle. These factors are then linked together in the form of new assessment model for object oriented software testability. The proposed model will be evaluated using analytical hierarchical process (AHP)

3D Array Block Rotation Cipher: An Improvement using lateral shift

This paper on Cipher based on 3D Array Block Rotation is in continuation with our earlier paper titled A cipher based on 3D Array Block Rotation. It discusses a new rotation; lateral shift along with the earlier discussed rotation of the 3D Array block or circular shifting of plates of 3D Array in clockwise direction while enciphering and anticlockwise direction while deciphering. It also discusses the problem of relative bit positioning in the earlier specified algorithm and introduce shift rotations of the blocks as a possible solution to the problem. It uses a key of specified length which can be either transferred with the ciphertext or can be obtained by an agreed upon random bit generator. In all, it is a novel and effective cipher with good randomness property

M-quasi-hyponormal composition operators

A necessary and sufficient condition is obtained for M-quasi-hyponormal composition operators. It has also been proved that the class of M-quasi-hyponormal composition operators coincides with the class of M-paranormal composition operators. Existence of M-hyponormal composition operators which are not hyponormal; and M-quasihyponormal composition operators which are not M-hyponormal and quasi-hyponormal are also shown